Orientations of digraphs almost preserving diameter
نویسندگان
چکیده
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. In this paper, we consider certain well-known classes of strong digraphs, each member D of which has an orientation with diameter not exceeding the diameter of D by more than a small constant.
منابع مشابه
Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conje...
متن کاملAlmost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conje...
متن کاملNonexistence of Almost Moore Digraphs of Diameter Four
Regular digraphs of degree d > 1, diameter k > 1 and order N(d, k) = d+· · ·+dk will be called almost Moore (d, k)-digraphs. So far, the problem of their existence has only been solved when d = 2, 3 or k = 2, 3. In this paper we prove that almost Moore digraphs of diameter 4 do not exist for any degree d.
متن کاملSubdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum outdegree d and diameter k. An upper bound is given by the Moore bound M(d, k) = ∑k i=0 d i and almost Moore digraphs are digraphs with maximum out-degree d, diameter k and order M(d, k)− 1. In this paper we will look at the structure of subdigraphs of almost...
متن کاملFurther results on almost Moore digraphs
The nonexistence of digraphs with order equal to the Moore bound Md;k = 1+d+: : :+d k for d; k > 1 has lead to the study of the problem of the existence ofàlmost' Moore digraphs, namely digraphs with order close to the Moore bound. In 1], it was shown that almost Moore digraphs of order Md;k ? 1, degree d, diameter k (d; k 3) contain either no cycle of length k or exactly one such cycle. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 121 شماره
صفحات -
تاریخ انتشار 2002